DISWOP: A Novel Scheduling Algorithm for Data-Intensive Workflow Optimizations
نویسندگان
چکیده
منابع مشابه
Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملWaaS: Workflow-as-a-Service for the Cloud with Scheduling of Continuous and Data-Intensive Workflows
Data-intensive and long-lasting applications running in the form of workflows are being increasingly dispatched to cloud computing systems. Current scheduling approaches for graphs of dependencies fail to deliver high resource efficiency while keeping computation costs low, especially for continuous data processing workflows, where the scheduler does not perform any reasoning about the impact n...
متن کاملA Simulator for Data-Intensive Job Scheduling
Despite the fact that size-based schedulers can give excellent results in terms of both average response times and fairness, data-intensive computing execution engines generally do not employ size-based schedulers, mainly because of the fact that job size is not known a priori. In this work, we perform a simulation-based analysis of the performance of size-based schedulers when they are employe...
متن کاملWorkflow Scheduling Techniques for Big Data Platforms
Today, almost everyone is connected to the Internet and uses different Cloud solutions to store, deliver, and process data. Cloud computing assembles large networks of virtualized services, such as hardware and software resources [1]. The use of cloud resources by end users is made in an asynchronous way and in many cases using mobile devices over different types of networks. Interoperability f...
متن کاملA Heuristic Scheduling Algorithm for Distributed Systems with Workflow Constraints
Distributed systems become one of the most important computing platform because they can efficiently handle large amount of data with a high computing workload. However, the job scheduling in the distributed systems is not a trivial issue. It can be even more complex when dealing with workflow-based composite jobs, i.e., each job has multiple tasks with dependencies between them. As the job sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2012
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e95.d.1839